#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int n, m;
int p[N], num;
void solve() {
  cin >> n;
  num = 0;
  vector<vector<int>> ch(n + 1, vector<int>());
  vector<int> ind(n + 1, 0);
  rep(i, 2, n) {
    int u, v, x, y;
    cin >> u >> v >> x >> y;
    if (x > y)
      ch[v].push_back(u), ind[u]++;
    else
      ch[u].push_back(v), ind[v]++;
  }
  queue<int> q;
  rep(i, 1, n) if (!ind[i]) q.push(i);
  while (q.size()) {
    int u = q.front();
    q.pop();
    p[u] = ++num;
    for (int v : ch[u])
      if (!--ind[v]) q.push(v);
  }
  rep(i, 1, n) cout << p[i] << " \n"[i == n];
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}